Perfect Algebraic Coarsening
نویسنده
چکیده
Presented in this paper is a new sparse linear solver methodology motivated by multigrid principles and based around general local transformations that diagonalize a matrix while maintaining its sparsity. These transformations are approximate, but the error they introduce can be systematically reduced. The cost of each transformation is independent of matrix size but dependent on the desired accuracy and a spatial error decay rate governed by local properties of the matrix. We test our method by applying a single transformation to the 2D Helmholtz equation at various frequencies, which illustrates the success of this approach.
منابع مشابه
Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning
Multilevel partitioning methods that are inspired by principles of multiscaling are the most powerful practical hypergraph partitioning solvers. Hypergraph partitioning has many applications in disciplines ranging from scientific computing to data science. In this paper we introduce the concept of algebraic distance on hypergraphs and demonstrate its use as an algorithmic component in the coars...
متن کاملAlgebraic interface-based coarsening AMG preconditioner for multi-scale sparse matrices with applications to radiation hydrodynamics computation
Coarsening is one of the crucial components of an algebraic multigrid (AMG) method for iteratively solving sparse linear systems arising from scientific and engineering applications. It largely determines the complexity of the AMG iteration operator. Usually, high operator complexities lead to fast converge of the AMG method, however, they require additional memory and as such do not scale as w...
متن کاملCompatible Relaxation and Coarsening in Algebraic Multigrid
We introduce a coarsening algorithm for algebraic multigrid (AMG) based on the concept of compatible relaxation (CR). The algorithm is significantly different from standard methods, most notably because it does not rely on any notion of strength of connection. We study its behavior on a number of model problems, and evaluate the performance of an AMG algorithm that incorporates the coarsening a...
متن کاملON RELATIVE CENTRAL EXTENSIONS AND COVERING PAIRS
Let (G;N) be a pair of groups. In this article, first we con-struct a relative central extension for the pair (G;N) such that specialtypes of covering pair of (G;N) are homomorphic image of it. Second, weshow that every perfect pair admits at least one covering pair. Finally,among extending some properties of perfect groups to perfect pairs, wecharacterize covering pairs of a perfect pair (G;N)...
متن کاملReducing Complexity in Parallel Algebraic Multigrid Preconditioners
Algebraic multigrid (AMG) is a very efficient iterative solver and preconditioner for large unstructured linear systems. Traditional coarsening schemes for AMG can, however, lead to computational complexity growth as problem size increases, resulting in increased memory use and execution time, and diminished scalability. Two new parallel AMG coarsening schemes are proposed, that are based on so...
متن کامل